/*
 * @Description: 
 * @Author: bing
 * @Date: 2021-08-03 17:38:17
 * @LastEditors: bing
 * @LastEditTime: 2021-08-03 17:43:22
 */
#include <iostream>
#include <string>
#include <deque>
#include <algorithm>
#include <list>

using namespace std;
#
void test()
{
    deque<string> de;
    de.push_back("a");
    de.push_back("b");
    de.push_back("b");
    de.push_back("c");
    de.push_back("d");
    de.push_back("d");

    deque<string> de1;
    de1.push_back("e");
    de1.push_back("f");
    de1.push_back("g");
    de1.push_back("h");
    de1.push_back("g");
    de1.push_back("h");
    list<int> l;

    deque<int> de2;
    de2.push_back(1);
    de2.push_back(2);
    de2.push_back(2);
    de2.push_back(3);
    de2.push_back(1);
    de2.push_back(7);
    de2.push_back(3);
    de2.push_back(1);
    de2.push_back(7);

    // de1.swap(de);
    sort(de2.begin(), de2.end());
    unique(de2.begin(), de2.end()); // 测试未通过
    cout << "de:";
    for (deque<int>::iterator it = de2.begin(); it != de2.end(); it++)
    {
        cout << *it << " ";
    }
    cout << endl;

    // cout << "de:";
    // for (deque<string>::iterator it = de.begin(); it != de.end(); it++)
    // {
    //     cout << *it << " ";
    // }
    // cout << endl;

    // cout << "de1:";
    // for (deque<string>::iterator it = de1.begin(); it != de1.end(); it++)
    // {
    //     cout << *it << " ";
    // }
    // cout << endl;
}

int main()
{
    test();
    return 1;
}